Locating Matches of Tree Patterns in Forests
Identifieur interne : 000251 ( LNCS/Analysis ); précédent : 000250; suivant : 000252Locating Matches of Tree Patterns in Forests
Auteurs : Andreas Neumann [Allemagne] ; Helmut Seidl [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1998.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Abstract: We deal with matching and locating of patterns in forests of variable arity. A pattern consists of a structural and a contextual condition for subtrees of a forest, both of which are given as tree or forest regular languages. We use the notation of constraint systems to uniformly specify both kinds of conditions. In order to implement pattern matching we introduce the class of pushdown forest automata. We identify a special class of contexts such that not only pattern matching but also locating all of a forest’s subtrees matching in context can be performed in a single traversal. We also give a method for computing the reachable states of an automaton in order to minimize the size of transition tables.
Url:
DOI: 10.1007/978-3-540-49382-2_12
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001315
- to stream Istex, to step Curation: 001203
- to stream Istex, to step Checkpoint: 000E69
- to stream Main, to step Merge: 002687
- to stream PascalFrancis, to step Corpus: 001059
- to stream PascalFrancis, to step Curation: 001735
- to stream PascalFrancis, to step Checkpoint: 000E89
- to stream Main, to step Merge: 002760
- to stream Main, to step Curation: 002298
- to stream Main, to step Exploration: 002298
- to stream LNCS, to step Extraction: 000251
Links to Exploration step
ISTEX:4EBE51C251F9ABCEAB9CB94482DC467C5F02286ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Locating Matches of Tree Patterns in Forests</title><author><name sortKey="Neumann, Andreas" sort="Neumann, Andreas" uniqKey="Neumann A" first="Andreas" last="Neumann">Andreas Neumann</name></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:4EBE51C251F9ABCEAB9CB94482DC467C5F02286A</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/978-3-540-49382-2_12</idno><idno type="url">https://api.istex.fr/document/4EBE51C251F9ABCEAB9CB94482DC467C5F02286A/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001315</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001315</idno><idno type="wicri:Area/Istex/Curation">001203</idno><idno type="wicri:Area/Istex/Checkpoint">000E69</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000E69</idno><idno type="wicri:doubleKey">0302-9743:1998:Neumann A:locating:matches:of</idno><idno type="wicri:Area/Main/Merge">002687</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:99-0048931</idno><idno type="wicri:Area/PascalFrancis/Corpus">001059</idno><idno type="wicri:Area/PascalFrancis/Curation">001735</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000E89</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000E89</idno><idno type="wicri:doubleKey">0302-9743:1998:Neumann A:locating:matches:of</idno><idno type="wicri:Area/Main/Merge">002760</idno><idno type="wicri:Area/Main/Curation">002298</idno><idno type="wicri:Area/Main/Exploration">002298</idno><idno type="wicri:Area/LNCS/Extraction">000251</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Locating Matches of Tree Patterns in Forests</title><author><name sortKey="Neumann, Andreas" sort="Neumann, Andreas" uniqKey="Neumann A" first="Andreas" last="Neumann">Andreas Neumann</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Computer Science, University of Trier</wicri:regionArea><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Computer Science, University of Trier</wicri:regionArea><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1998</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">4EBE51C251F9ABCEAB9CB94482DC467C5F02286A</idno><idno type="DOI">10.1007/978-3-540-49382-2_12</idno><idno type="ChapterID">12</idno><idno type="ChapterID">Chap12</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term><term>Push down automaton</term><term>Reachability analysis</term><term>Tree automaton</term><term>Tree data structures</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Analyse atteignabilité</term><term>Automate arbre</term><term>Automate à pile</term><term>Informatique théorique</term><term>Structure donnée arborescente</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We deal with matching and locating of patterns in forests of variable arity. A pattern consists of a structural and a contextual condition for subtrees of a forest, both of which are given as tree or forest regular languages. We use the notation of constraint systems to uniformly specify both kinds of conditions. In order to implement pattern matching we introduce the class of pushdown forest automata. We identify a special class of contexts such that not only pattern matching but also locating all of a forest’s subtrees matching in context can be performed in a single traversal. We also give a method for computing the reachable states of an automaton in order to minimize the size of transition tables.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Neumann, Andreas" sort="Neumann, Andreas" uniqKey="Neumann A" first="Andreas" last="Neumann">Andreas Neumann</name></region><name sortKey="Neumann, Andreas" sort="Neumann, Andreas" uniqKey="Neumann A" first="Andreas" last="Neumann">Andreas Neumann</name><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000251 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000251 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:4EBE51C251F9ABCEAB9CB94482DC467C5F02286A
|texte= Locating Matches of Tree Patterns in Forests
}}
| This area was generated with Dilib version V0.6.31. |  |